Faster exact solutions for some NP-hard problems
نویسندگان
چکیده
منابع مشابه
Faster Exact Solutions for Some NP-Hard Problems
This paper considers a number of NP-complete problems, and provides faster algorithms for solving them. The solutions are based on a recursive partitioning of the problem domain, and careful elimination of some of the branches along the search without actually checking them. The time complexity of the proposed algorithms is of the form O(2 ) for constant 0¡ ¡ 1, where n is the output size of th...
متن کاملProbabilistic solutions to some NP-hard matrix problems
During recent years, it has been shown that a number of problems in matrix theory are NP-hard, including robust nonsingularity, robust stability, robust positive semide"niteness, robust bounded norm, state feedback stabilization with structural and norm constraints, etc. In this paper, we use standard bounds on empirical probabilities as well as recent results from statistical learning theory o...
متن کاملExact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, ba...
متن کاملFaster Exact Algorithms for Some Terminal Set Problems
Many problems on graphs can be expressed in the following language: given a graph G = (V,E) and a terminal set T ⊆ V , find a minimum size set S ⊆ V which intersects all “structures” (such as cycles or paths) passing through the vertices in T . We call this class of problems as terminal set problems. In this paper we introduce a general method to obtain faster exact exponential time algorithms ...
متن کاملChecking for optimal solutions in some NP-complete problems.
For some weighted NP-complete problems, checking whether a proposed solution is optimal is a nontrivial task. Such is the case for the traveling salesman problem, or the spin-glass problem in three dimensions. In this Letter, we consider the weighted tripartite matching problem, a well known NP-complete problem. We write mean-field finite temperature equations for this model and derive their ze...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00257-2